Universal Gaussian Quantization with Side-Information using Polar Lattices

نویسندگان

چکیده

We consider universal quantization with side information for Gaussian observations, where the is a noisy version of sender’s observation noise variance unknown to sender. In this paper, we propose universally rate optimal and practical scheme all values variance. Our uses Polar lattices from prior work, proceeds based on structural decomposition underlying auxiliaries so that even when recovery fails in round, parties agree common “reference point” closer than previous one. also present finite blocklength analysis showing an sub-exponential convergence distortion exponential rate. The overall complexity our O(N2log2N) any target fixed larger rate-distortion bound.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice Quantization with Side Information

We consider the design of lattice vector quantizers for the problem of coding Gaussian sources with uncoded side information available only at the decoder. The design of such quantizers can be reduced to the problem of nding an appropriate sublattice of a given lattice codebook. We study the performance of the resulting quantizers in the limit as the encoding rate becomes high, and we evaluate ...

متن کامل

Universal portfolios with side information

We present a sequential investment algorithm, the -weighted universal portfolio with side-information, which achieves, to rst order in the exponent, the same wealth as the best side-information dependent investment strategy (the best state-constant rebalanced portfolio) determined in hindsight from observed market and side-information outcomes. This is an individual sequence result which shows ...

متن کامل

On residuated lattices with universal quantifiers

We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

Computing Gaussian Mixture Models with EM using Side-Information

Estimation of Gaussian mixture models is an efficient and popular technique for clustering and density estimation. An EM procedure is widely used to estimate the model parameters. In this paper we show how side information in the form of equivalence constraints can be incorporated into this procedure, leading to improved clustering results. Equivalence constraints are prior knowledge concerning...

متن کامل

Optimal Universal Lossless Compression with Side Information

This paper presents conditional versions of Lempel-Ziv (LZ) algorithm for settings where compressor and decompressor have access to the same side information. We propose a fixed-length-parsing LZ algorithm with side information, motivated by the Willems algorithm, and prove the optimality for any stationary processes. In addition, we suggest strategies to improve the algorithm which lower the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE journal on selected areas in information theory

سال: 2023

ISSN: ['2641-8770']

DOI: https://doi.org/10.1109/jsait.2023.3247864